On enumerating all minimal solutions of feedback problems
نویسندگان
چکیده
منابع مشابه
On enumerating all minimal solutions of feedback problems
We present an algorithm that generates all (inclusion-wise) minimal feedback vertex sets of a directed graph G = (V, E). The feedback vertex sets of G are generated with a polynomial delay of O ( |V |(|V | + |E|) ) . We further show that the underlying technique can be tailored to generate all minimal solutions for the undirected case and the directed feedback arc set problem, both with a polyn...
متن کاملEnumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and Hébrard [CH97] and generalized by Cohen [Coh04], reduces the enumeration problem for a constraint language Γ to the decision problem for a slightly enlarged constraint language Γ, i.e., it yields an efficient enumeration...
متن کاملDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequalities in n variables, the number of maximal infeasible integer vectors is at most rn times the number of minimal integer solutions to the system. This bound is accurate up to a polylog(r) factor and leads to a polynomial-...
متن کاملOn Minimal Order Decentralized Output Feedback Pole Assignment Problems
We give a new sufficient condition for the arbitrary pole assignability of a system by decentralized dynamic compensators. Using such condition we are able to derive a new bound on the degrees of decentralized dynamic compensators so that the generic systems have the arbitrary pole assignability.
متن کاملSolutions to Minimal Generalized Relative Pose Problems
We present a method to obtain the solutions to the generalized 6-point relative pose problem. The problem is to find the relative positions of two generalized cameras so that six corresponding image rays meet in space. Here, a generalized camera is a camera that captures some arbitrary set of rays and does not adhere to the central perspective projection model. The cameras are assumed to be cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00339-5